Approximate Local Search in Combinatorial Optimization
نویسندگان
چکیده
منابع مشابه
Winner Determination in Combinatorial Auctions using Hybrid Ant Colony Optimization and Multi-Neighborhood Local Search
A combinatorial auction is an auction where the bidders have the choice to bid on bundles of items. The WDP in combinatorial auctions is the problem of finding winning bids that maximize the auctioneer’s revenue under the constraint that each item can be allocated to at most one bidder. The WDP is known as an NP-hard problem with practical applications like electronic commerce, production manag...
متن کامل(Collaborative Reactive Search Optimization): Blending Combinatorial and Continuous Local Search
We propose a heuristic global optimization technique which combines combinatorial and continuous local search. The combinatorial component, based on Reactive Search Optimization, generates a trajectory of binary strings describing search districts. Each district is evaluated by random sampling and by selective runs of continuous local search. A reactive prohibition mechanisms guarantees that th...
متن کاملApproximate Shifted Combinatorial Optimization
Shifted combinatorial optimization is a new nonlinear optimization framework, which is a broad extension of standard combinatorial optimization, involving the choice of several feasible solutions at a time. It captures well studied and diverse problems ranging from congestive to partitioning problems. In particular, every standard combinatorial optimization problem has its shifted counterpart, ...
متن کاملStochastic Local Search Algorithms for Multiobjective Combinatorial Optimization
The information provided is the sole responsibility of the authors and does not necessarily reflect the opinion of the members of IRIDIA. The authors take full responsability for any copyright breaches that may result from publication of this paper in the IRIDIA – Technical Report Series. IRIDIA is not responsible for any use that might be made of data appearing in this publication.
متن کاملSampling Strategies and Local Search for Stochastic Combinatorial Optimization
In recent years, much attention has been devoted to the development of metaheuristics and local search algorithms for tackling stochastic combinatorial optimization problems. In this paper, we propose an effective local search algorithm that makes use of empirical estimation techniques for a class of stochastic combinatorial optimization problems. We illustrate our approach and assess its perfo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Computing
سال: 2004
ISSN: 0097-5397,1095-7111
DOI: 10.1137/s0097539703431007